Convex decomposition of games and axiomatizations of the core and the D-core

Abstract: This paper provides an axiomatic framework to compare the D-core (the set of undominated imputations) and the core of a cooperative game with transferable utility. Theorem 1 states that the D-core is the only solution satisfying projection consistency, reasonableness (from above), (∗)-antimonotonicity, and modularity. Theorem 2 characterizes the core replacing (∗)-antimonotonicity by antimonotonicity. Moreover, these axioms also characterize the core on the domain of convex games, totally balanced games, balanced games, and superadditive games.